#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=2e5+1000;
typedef long long LL;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
string removeOccurrences(string s, string part) {
       while(s.find(part)!=string::npos)
       {
            int pos=s.find(part);
            s.erase(pos,part.length());
       }
       return s;
}
int main(void){
    string s,part;cin>>s>>part;
    cout<<removeOccurrences(s,part)<<endl;
   	return 0;
}
